Driven discrete time quantum walks
نویسندگان
چکیده
منابع مشابه
Discrete-Time Quantum Walks and Graph Structures
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total entropies of the average mixing matrices for some cubic graphs. The trace captures how likely a quantum walk is to revisit the state it started with, and the...
متن کاملCrossovers induced by discrete-time quantum walks
We consider crossovers with respect to the weak convergence theorems from a discretetime quantum walk (DTQW). We show that a continuous-time quantum walk (CTQW) and discreteand continuous-time random walks can be expressed as DTQWs in some limits. At first we generalize our previous study [Phys. Rev. A 81, 062129 (2010)] on the DTQW with position measurements. We show that the position measurem...
متن کاملScattering theory and discrete-time quantum walks
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each, and consider walks that proceed from one half line, through the graph, to the other. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the g...
متن کاملDriven quantum walks.
We introduce the concept of a driven quantum walk. This work is motivated by recent theoretical and experimental progress that combines quantum walks and parametric down-conversion, leading to fundamentally different phenomena. We compare these striking differences by relating the driven quantum walks to the original quantum walk. Next, we illustrate typical dynamics of such systems and show th...
متن کاملAn Edge-Based Matching Kernel Through Discrete-Time Quantum Walks
In this paper, we propose a new edge-based matching kernel for graphs by using discrete-time quantum walks. To this end, we commence by transforming a graph into a directed line graph. The reasons of using the line graph structure are twofold. First, for a graph, its directed line graph is a dual representation and each vertex of the line graph represents a corresponding edge in the original gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2016
ISSN: 1367-2630
DOI: 10.1088/1367-2630/18/7/073008